Towards Content-Addressing in Data Bases
نویسندگان
چکیده
منابع مشابه
Towards Content Aggregation on Knowledge Bases through Graph Clustering
Recently, several research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which have been targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary for participants to provide brief descriptions of themselves, so that routing algorithms or matchmaking processes can make decisions about which communities peers sh...
متن کاملTowards OpenMath Content Dictionaries as Linked Data
“The term ‘Linked Data’ refers to a set of best practices for publishing and connecting structured data on the web” [7]. Linked Data make the Semantic Web work practically, which means that information can be retrieved without complicated lookup mechanisms, that a lightweight semantics enables scalable reasoning, and that the decentral nature of the Web is respected. OpenMath Content Dictionari...
متن کاملAddressing user expectations in mobile content delivery
Multimedia services like television programs and live streaming of mobile videos can be delivered to mobile terminals via different access technologies. The question is – how do users perceive such services on mobile terminals? The objective of this study is to find the correlation between video quality thresholds and the user context. Our study reveals the thresholds of user’s quality of exper...
متن کاملBalanced Dynamic Content Addressing in Trees
Balancing the load in content addressing schemes for route-restricted networks represents a challenge with a wide range of applications. Solutions based on greedy embeddings maintain minimal state information and enable efficient routing, but any such solutions currently result in either imbalanced content addressing, overloading individual nodes, or are unable to efficiently account for networ...
متن کاملTowards Probabilistic Knowledge Bases
We deene a new xpoint semantics for rule-based reasoning in the presence of vague or imprecise information. Such a semantics should fullll two requirements. First, it must coincide with the intuitive understanding of the given information, and second, the semantics must be computationally tractable. We show that our semantics fulllls the rst requirement and we formally verify that our xpoint se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1972
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/15.2.95